Stability Criteria For Queueing Networks with a Monotonicity Property
نویسنده
چکیده
منابع مشابه
Stability in Queueing Networks via the Finite Decomposition Property
Determination of the stability behavior of a queueing network is an important part of analyzing such systems. In Gamarnik and Hasenbein (2005) it is shown if a fluid network has the finite decomposition property (FDP) and is not weakly stable, then any queueing network associated with the fluid network is not rate stable. In that paper the FDP was demonstrated for two station queueing networks ...
متن کاملPathwise comparison results for stochastic fluid networks
We prove some new pathwise comparison results for single class stochastic fluid networks. Under fairly general conditions, monotonicity with respect to the (stateand time-dependent) routing matrices is shown. Under more restrictive assumptions, monotonicity with respect to the service rates is shown as well. We conclude by using the comparison results to establish a moment bound, a stability re...
متن کاملStability of traffic flow networks with a polytree topology
We consider global stability of a flow network model for vehicular traffic. Standard approaches which rely on monotonicity of flow networks for stability analysis do not immediately apply to traffic networks with diverging junctions. In this paper, we show that the network model nonetheless exhibits a mixed monotonicity property. Mixed monotonicity allows us to prove global asymptotic stability...
متن کاملConvergence rates in monotone separable stochastic networks
We study bounds on the rate of convergence to the stationary distribution in monotone separable networks which are represented in terms of stochastic recursive sequences. Monotonicity properties of this subclass of Markov chains allow us to formulate conditions in terms of marginal network characteristics. Two particular examples, generalized Jackson networks and multiserver queues, are conside...
متن کاملMonotone control of queueing networks
This paper uses submodularity to obtain monotonicity results for a class of Markovian queueing network service rate control problems. Nonlinear costs of queueing and service are allowed. In contrast to Weber and Stidham [14], our monotonicity theorem considers arbitrary directions in the state space (not just control directions), arrival routing problems, and certain uncontrolled service rates....
متن کامل